Declarative recursive computation on an RDBMS
نویسندگان
چکیده
منابع مشابه
Declarative Logic Programming with Primitive Recursive Relations on Lists
In a previous paper we introduced a system of recursion operators for formulating pure logic programs, dispensing with explicit recursions. The recursion operators, some of which are similar to higher-order functions known from functional programming, take the form of quasi-higher order predicates. In this paper we identify a comprehensive class of logic programs called primitive recursive rela...
متن کاملDeclarative, Secure, Convergent Edge Computation
Eventual consistency is a more natural model than strong consistency for a distributed system, since it is closer to the underlying physical reality. Therefore, we propose that it is important to find a programming model that is both congenial to developers and supports eventual consistency. In particular, we consider that a crucial test for such a model is that it should support edge computati...
متن کاملDeclarative Networking with Distributed Recursive Query Processing
There have been recent proposals in the networking and distributed systems literature on declarative networks, where networks are declaratively specified using a recursive query language. This represents a significant new application area for database recursive query processing technologies. In this paper, we extend upon these recent work in the following ways. First, we define and motivate the...
متن کاملDeclarative Networking with Distributed Recursive Query Processing
There have been recent proposals in the networking and distributed systems literature on declarative networking, where network protocols are declaratively specified using a recursive query language. This represents a significant new application area for recursive query processing technologies from databases. In this paper, we extend upon these recent proposals in the following ways. First, we m...
متن کاملRecursive computation of coprime factorizations
We propose general computational procedures based on descriptor state-space realizations to compute coprime factorizations of rational matrices with minimum degree denominators. Enhanced recursive pole dislocation techniques are developed, which allow to successively place all poles of the factors into a given “good” domain of the complex plane. The resulting McMillan degree of the denominator ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2019
ISSN: 2150-8097
DOI: 10.14778/3317315.3317323